Efficiency of mutation operators and selective mutation strategies: an empirical study

Author(s):  
Elfurjani S. Mresa ◽  
Leonardo Bottaci
IET Software ◽  
2017 ◽  
Vol 11 (6) ◽  
pp. 292-300
Author(s):  
Osama Alkrarha ◽  
Jameleddine Hassine

Author(s):  
Shweta Rani ◽  
Bharti Suri

Mutation testing is a successful and powerful technique, specifically designed for injecting the artificial faults. Although it is effective at revealing the faults, test suite assessment and its reduction, however, suffer from the expense of executing a large number of mutants. The researchers have proposed different types of cost reduction techniques in the literature. These techniques highly depend on the inspection of mutation operators. Several metrics have been evolved for the same. The selective mutation technique is most frequently used by the researchers. In this paper, the authors investigate different metrics for evaluating the traditional mutation operators for Java. Results on 13 Java programs indicate how grouping few operators can impact the effectiveness of an adequate and minimal test suite, and how this could provide several cost benefits.


2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Hong Li ◽  
Li Zhang

Two mutation operators are used in the differential evolution algorithm to improve the diversity of population. An improved constraint-handling technique based on a comparison mechanism is presented, and then it is combined with the selection operator in the differential evolution algorithm to fulfill constraint handling and selection simultaneously. A differential evolution with two mutation strategies and a selection based on this improved constraint-handling technique is developed to solve bilevel programming problems. The simulation results on some linear and nonlinear bilevel programming problems show the effectiveness and efficiency of the proposed algorithm.


2016 ◽  
Vol 7 (2) ◽  
pp. 12-44
Author(s):  
Vanita Garg ◽  
Kusum Deep

Biogeography-Based optimization (BBO) is a nature inspired optimization technique that has excellent exploitation ability but the exploration ability needs to be improved to make it more robust. With this objective in mind, Garg and Deep proposed Laplacian BBO (LX-BBO) based on the Laplace Crossover which is a Real Coded Genetic Crossover Operator. It was concluded that LX- BBO outperforms its competitors. A natural question is to incorporate real coded mutation strategies into LX-BBO in order to improve its diversity. Therefore, in this paper, the exploring ability of LX-BBO is further investigated by using six different types of mutation operators present in literature. Gaussian, Cauchy, Levy, Power, Polynomial and Random mutation are used to test which mutation works best for LX-BBO. The performance of all these versions of BBO are measured on the benchmark problem set proposed in CEC 2014. On the basis of the criteria lay down by CEC, analysis of numerical and graphical results and statistical tests it is concluded that LX-BBO works best with Random and Cauchy Mutation.


2017 ◽  
Vol 27 (4-5) ◽  
pp. e1630 ◽  
Author(s):  
Pedro Delgado-Pérez ◽  
Sergio Segura ◽  
Inmaculada Medina-Bulo

1996 ◽  
Vol 81 (1) ◽  
pp. 76-87 ◽  
Author(s):  
Connie R. Wanberg ◽  
John D. Watt ◽  
Deborah J. Rumsey

Sign in / Sign up

Export Citation Format

Share Document